Word Lattice: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". " to ". ") |
m (Text replacement - "]]↵----" to "]]. ----") |
||
| Line 1: | Line 1: | ||
A [[Word Lattice]] is a [[lattice]] whose [[node]]s represent [[NL word]]s. | A [[Word Lattice]] is a [[lattice]] whose [[node]]s represent [[NL word]]s. | ||
* <B>See:</B> [[Confusion Network]] | * <B>See:</B> [[Confusion Network]]. | ||
---- | ---- | ||
---- | ---- | ||
== References == | == References == | ||
* http://www.google.com/search?q=word+lattice&tbm=isch | * http://www.google.com/search?q=word+lattice&tbm=isch | ||
Latest revision as of 05:30, 28 November 2023
A Word Lattice is a lattice whose nodes represent NL words.
- See: Confusion Network.
References
2010
- (Navigli & Velardi, 2010) ⇒ Roberto Navigli, and Paola Velardi. (2010). “Learning Word-class Lattices for Definition and Hypernym Extraction.” In: Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL-2010).
- QUOTE: In this paper, we propose Word-Class Lattices (WCLs), a generalization of word lattices that we use to model textual definitions. ...
... In speech processing, phoneme or word lattices (Campbell et al., 2007; Mathias and Byrne, 2006; Collins et al., 2004) are used as an interface between speech recognition and understanding.
- QUOTE: In this paper, we propose Word-Class Lattices (WCLs), a generalization of word lattices that we use to model textual definitions. ...
2009
- http://www.statmt.org/moses/?n=Moses.WordLattices
- A word lattice is a directed acyclic graph with a single start point and edges labeled with a word and weight. Unlike confusion networks which additionally impose the requirement that every path must pass through every node, word lattices can represent any finite set of strings (although this generality makes word lattices slightly less space-efficient than confusion networks). However, in general a word lattice can represent an exponential number of sentences in polynomial space.
2008
- (Dyer et al., 2008) ⇒ Christopher Dyer, Smaranda Muresan, and Philip Resnik. (2008). {Generalizing word lattice translation." No. LAMP-TR-149. MARYLAND UNIV COLLEGE PARK INST FOR ADVANCED COMPUTER STUDIES, 2008.
2007
- (Campbell, Richardson & Reynolds, 2007) ⇒ William M. Campbell, M. F. Richardson, and D. A. Reynolds. (2007). “Language Recognition with Word Lattices and Support Vector Machines.” In: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP-2007).
2006
- (Mathias & Byrne, 2006) ⇒ Lambert Mathias, and William Byrne. (2006). “Statistical Phrase-based Speech Translation". In: Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006).
2004
- (Collins, Carpenter, & Penn, 2004) ⇒ Christopher Collins, Bob Carpenter, Gerald Penn. (2004). “Head-driven Parsing for Word Lattices.” In: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics (ACL-2004). doi:10.3115/1218955.1218985