Abstract
Finite state cascades represent an attractive architecture for
parsing unrestricted text. Deterministic parsers specified by finite state
cascades are fast and reliable. They can be extended at
modest cost to construct parse trees with finite feature structures.
Finally, such deterministic
parsers do not necessarily involve trading off accuracy against speed —
they may in fact be
more accurate than exhaustive search stochastic context free parsers.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics,Software
Cited by
102 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献