Sciweavers

1380 search results - page 202 / 276
» Decomposable Modeling in Natural Language Processing
Sort
View
87
Voted
ECBS
2006
IEEE
158views Hardware» more  ECBS 2006»
15 years 3 months ago
Automated Translation of C/C++ Models into a Synchronous Formalism
For complex systems that are reusing intellectual property components, functional and compositional design correctness are an important part of the design process. Common system l...
Hamoudi Kalla, Jean-Pierre Talpin, David Berner, L...
ACL
2006
14 years 11 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas
EACL
2003
ACL Anthology
14 years 11 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
CLEF
2008
Springer
14 years 11 months ago
Allomorfessor: Towards Unsupervised Morpheme Analysis
Many modern natural language processing applications would benefit from automatic morphological analysis of words, especially when dealing with morphologically rich languages. Con...
Oskar Kohonen, Sami Virpioja, Mikaela Klami
SIGSOFT
2003
ACM
15 years 10 months ago
Bogor: an extensible and highly-modular software model checking framework
Model checking is emerging as a popular technology for reasoning about behavioral properties of a wide variety of software artifacts including: requirements models, architectural ...
Robby, Matthew B. Dwyer, John Hatcliff