... can split intonon-bigrams (without a huge index) and to handle si-multaneous merging and splitting as in our runningexample (1). Furthermore, they translate bigram in- formation into edge weights, ... directly without find-ing topPathsD(s) first. However, we chose ourmethod (finding top paths first, and then re-ranking) to avoid the inherent computational hardness in- volved in finding maximal cliques.2.3 ... spelling erroris word -to- word error: a single word w is misspelledinto another single word w. The specific spelling er-rors involved include omission of a character (e.g.,atachment), inclusion...