DM Smith wrote: > If we had a mapping of which words and or phrases in a given language mapped > to a Strong's number, then one could write a program that tagged best matches.
That makes it sound far more easier than it is in practice. > Now I've taken enough language classes to know that the effort would > be imprecise. Proofreading would be necessary. I've been looking at English mappings. The same English word can have two or more Strong's numbers. The same Strong number can have half a dozen English words. xan jonathon _______________________________________________ sword-devel mailing list: [email protected] http://www.crosswire.org/mailman/listinfo/sword-devel Instructions to unsubscribe/change your settings at above page
