815 search results - page 21 / 163 » Applications of Finite-State Transducers in Natural Language... |
AAAI
1994
13 years 8 months ago
1994
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
ESWS
2009
Springer
14 years 2 months ago
2009
Springer
Knowledge Acquisition through Semantic Annotation is vital to the evolution, growth and success of the Semantic Web. Both Semiautomatic and Manual Annotation are constricted by a ...
MICAI
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Conventional artificial neural network models lack many physiological properties of the neuron. Current learning algorithms are more concerned to computational performanc...
GECCO
2003
Springer
14 years 23 days ago
2003
Springer
The process of labeling each word in a sentence with one of its lexical categories (noun, verb, etc) is called tagging and is a key step in parsing and many other language processi...
EMNLP
2009
13 years 5 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...