id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
5259	Dolby, James L.	An Algorithm for Variable-Length Proper-Name Compression	1970-12-01	19	.pdf	application/pdf	6184	988	79	vowels only, to reduce the compressed form to four characters, deleting Ideally, it would be desirable to have a list of common errors in keyboarding names as a test basis for any proposed algorithms. As an alternative, one can study existing lists of personal-name equivalence classes to derive such algorithms and then test the algorithm against problems of truncating errors in name-compression algorithms, it is convenient to break the problem into two pieces. The algorithm splits 22 ( 4.9%) of the 451 equivalence classes given by 12) The algorithm fails to equate the various forms of McLaughlin 22) The algorithm fails to equate the various forms of the word Thompson (an -son problem.) marker is removed from all the five character codes, only six more overidentification errors are introduced. of the characters (A, E, I, 0, U, Y, H, W), and these markers are maintained as "padding" in the very short words, 18 errors of over-identification 	./cache/5259.pdf	./txt/5259.txt