Titlebook: Advances in Probabilistic and Other Parsing Technologies; Harry Bunt,Anton Nijholt Book 2000 Springer Science+Business Media Dordrecht 200

不可磨灭

刺耳的声音

https://doi.org/10.1007/978-94-015-9470-7Index; Parsing; algorithms; computational linguistics; grammar; linguistics; syntactic

马赛克

Entropion

洞穴

Applied and Numerical Harmonic Analysisd to first, in their early days, in relation to the compilation and interpretation of computer programs. Since computer programs have in common with written text that they consist of symbol strings that can be decomposed into meaningful substrings, the idea soon came up to apply the techniques of pr

酷热

Compressed Sensing and its Applicationsesentative framework. We consider systematically a number of alternative probabilistic frameworks, evaluating their adequacy from both a theoretical and empirical perspective using data from existing large treebanks. We also propose three orthogonal approaches for backing off probability estimates t

1FAWN

Ben Adcock,Anders C. Hansen,Bogdan Romanncratic selectional influences on each other. Such ‘bilexicalism’ has been a theme of much current work in parsing. The new formalism can be used to describe bilexical approaches to both dependency and phrase-structure grammars, and a slight modification yields link grammars. Its scoring approach is

Hdl348

Giulio Coluccia,Chiara Ravazzi,Enrico Magliharniak, and in experiments have comparable or better performance. PFGs generate features one at a time, probabilistically, conditioning the probabilities of each feature on other features in a local context. Because the conditioning is local, efficient polynomial time parsing algorithms exist for c

archetype

多嘴