3440 search results - page 23 / 688 » Logics For Context-Free Languages |
ACL
2006
14 years 11 months ago
2006
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...
ESOP
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
FSKD
2008
Springer
14 years 11 months ago
2008
Springer
PODS
2008
ACM
15 years 10 months ago
2008
ACM
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the...
FCT
1991
Springer
15 years 1 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...