Discovering characteristic expressions in literary works.
From MaRDI portal
Publication:1870549
DOI10.1016/S0304-3975(02)00185-8zbMATH Open1051.68130OpenAlexW2159903106MaRDI QIDQ1870549FDOQ1870549
Authors: Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00185-8
Recommendations
Cites Work
Cited In (7)
- Discovering instances of poetic allusion from anthologies of classical Japanese poems
- Finding characteristic substrings from compressed texts
- Special factors and the combinatorics of suffix and factor automata
- On-line construction of compact directed acyclic word graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient computation of substring equivalence classes with suffix arrays
This page was built for publication: Discovering characteristic expressions in literary works.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870549)