3241694
Descrição
Mapa Mental por Ivan Zapreev, atualizado more than 1 year ago
|
Criado por Ivan Zapreev
mais de 9 anos atrás
|
|
Language Identification and
Modelling in Specialized hardware
- Introduction
- Natural language processing
- Tasks
- Language identification
- Is essential to using
WEB as corpus
- Is essential to using
WEB as corpus
- Language Modelling
- Language identification
- Challenge
- Large data sizes
- Solution
- Use specialized Hardware
- Graphics processing units - GPUs
- Application
- Neural Networks
- Parsing
- Neural Networks
- Application
- Field-programmable
gate arrays - FPGAs
- Features
- Fast
- Customizable
- Fast
- Application
- Encoding Grammars
- Encoding Grammars
- Features
- Graphics processing units - GPUs
- Use specialized Hardware
- Large data sizes
- Tasks
- Natural language processing
- Research
- idea
- Repurpose Network
security hardware
- Application specific
integrated circuit for
network monitoring
- Deterministic
pushdown
transducer
- A finite state transducer (FST) is a finite
state automata (FSA) which produces
output as well as reading input - Finite
State Machine!
- Recursive finite-domain programs can be
characterized by finite-state transducers
that are augmented with a pushdown store.
Such transducers are called pushdown
transducers.
- Recursive finite-domain programs can be
characterized by finite-state transducers
that are augmented with a pushdown store.
Such transducers are called pushdown
transducers.
- A finite state transducer (FST) is a finite
state automata (FSA) which produces
output as well as reading input - Finite
State Machine!
- Has a stack
- Programmable
- Executes
regular
expressions
- POSIX
- When matched
- Outputs constant to CPU
- Use stack
- Push
- Pop
- Push
- Output matched span
- Halt
- Outputs constant to CPU
- POSIX
- Executes
regular
expressions
- No user
accessible
arithmetic
- Deterministic
pushdown
transducer
- Applications
- Reason
- Do not easily
map to regular
expressions
- Do not easily
map to regular
expressions
- Tasks
- Language
Identification
- Use model of Lui
and Baldwin, 2012
for 97 languages
- Naive Bayes
model
- Feature
strings are
converted to
literal regular
expressions
- Collect
feature
counts
- Collect
feature
counts
- Emulate
automata
on CPU
- Naive Bayes
model
- Use model of Lui
and Baldwin, 2012
for 97 languages
- Language
modelling
- Using back-off models
- Using Telescoping series
- A telescoping series is any series where
nearly every term cancels with a
preceeding or following term. For
instance, the series
Anotações:
- https://en.wikipedia.org/wiki/Telescoping_series
- http://math.oregonstate.edu/home/programs/undergrad/CalculusQuestStudyGuides/SandS/SeriesTests/telescoping.html
- Collapse prob and
back off into single
function
- Preserves
sentence-level
probabilities
- Sends just one value Q per token
and not probability and back offs
- Saves CPU workload
and communications
- Saves CPU workload
and communications
- Preserves
sentence-level
probabilities
- A telescoping series is any series where
nearly every term cancels with a
preceeding or following term. For
instance, the series
- Simplified query
- For each word match as
much context as possible
- Sends just one value Q per token
and not probability and back offs
- Sends just one value Q per token
and not probability and back offs
- For each word match as
much context as possible
- Using Telescoping series
- Use greedy matching
- Match as much
leading context as
possible
- Scanning until a
match is found
- Report the longest match
- Resume scanning
- The longest matching
N-gram will be reported
- Resume scanning
- Report the longest match
- Scanning until a
match is found
- Use "greedy"
regular
expressions
- Match as much
leading context as
possible
- Using back-off models
- Language
Identification
- Reason
- Application specific
integrated circuit for
network monitoring
- Repurpose Network
security hardware
- Experiments
- Performance Evaluation
- One core
- Language
identification
- 2.4 times faster
- As the fastest
CPU programm
- More details in
the paper
- tested against
some existing
models
- CLD2
- C++
- C++
- Original
- Python
- Java
- Python
- CLD2
- More details in
the paper
- As the fastest
CPU programm
- 2.4 times faster
- Language
modelling
- 1.8 to 6 times faster
- As CPU program
- KenLM
- DALM
- KenLM
- As CPU program
- Part of speech
- In corpus linguistics, part-of-speech tagging (POS tagging or POST), also called grammatical
tagging or word-category disambiguation, is the process of marking up a word in a text (corpus)
as corresponding to a particular part of speech, based on both its definition, as well as its
context—i.e. relationship with adjacent and related words in a phrase, sentence, or paragraph. A
simplified form of this is commonly taught to school-age children, in the identification of words
as nouns, verbs, adjectives, adverbs, etc.
Anotações:
- https://en.wikipedia.org/wiki/Part-of-speech_tagging
- In corpus linguistics, part-of-speech tagging (POS tagging or POST), also called grammatical
tagging or word-category disambiguation, is the process of marking up a word in a text (corpus)
as corresponding to a particular part of speech, based on both its definition, as well as its
context—i.e. relationship with adjacent and related words in a phrase, sentence, or paragraph. A
simplified form of this is commonly taught to school-age children, in the identification of words
as nouns, verbs, adjectives, adverbs, etc.
- 1.8 to 6 times faster
- Language
identification
- One core
- Tarari T2540
PCI express
- Controlled by
1-thread CPU
program
- Performed
arithmetic
- Scalable till
4 devices
- Performed
arithmetic
- Controlled by
1-thread CPU
program
- Performance Evaluation
- idea
Quer criar seus próprios Mapas Mentais gratuitos com a GoConqr? Saiba mais.