17 search results - page 1 / 4 » Compiling and Using Finite-State Syntactic Rules |
150
click to vote
COLING
1992
15 years 7 months ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
161
click to vote
ACL
1996
15 years 7 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
197
click to vote
WIA
2000
Springer
15 years 10 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
180
click to vote
ANLP
1997
15 years 7 months ago
1997
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
171
click to vote
FSMNLP
2005
Springer
15 years 12 months ago
2005
Springer
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...