Using eigenvectors of the bigram graph to infer morpheme identity
Mikhail BelkinJohn A. GoldsmithPublished in: CoRR (2002)
Keyphrases
- graph laplacian
- covariance matrix
- language model
- laplacian matrix
- random walk
- structured data
- graph structure
- graph theory
- morphological analysis
- principal component analysis
- bayesian networks
- graph model
- graph mining
- directed acyclic graph
- bipartite graph
- ranking algorithm
- directed graph
- graph representation
- eigenvalues and eigenvectors
- graph matching
- spanning tree
- minimum spanning tree
- spectral analysis
- random graphs
- graph structures
- knn
- probabilistic model
- adjacency matrix
- social networks