Using eigenvectors of the bigram graph to infer morpheme identity.
Mikhail BelkinJohn A. GoldsmithPublished in: SIGMORPHON (2002)
Keyphrases
- language model
- random walk
- morphological analysis
- eigenvalues and eigenvectors
- graph laplacian
- bipartite graph
- laplacian matrix
- structured data
- covariance matrix
- directed graph
- graph matching
- graph representation
- graph structure
- graph mining
- graph theory
- graph databases
- link analysis
- pairwise
- adjacency matrix
- word order
- data points