{'fraction_non_alphanumeric': 0.01972386587771203, 'fraction_numerical': 0.0, 'mean_word_length': 4.976470588235294, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Real-Time Dense Map Matching with Naive Hidden Markov Models : Delay versus Accuracy

In this paper, an algorithm for map matching is proposed, based on a Viterbi algorithm running over a Hidden Markov Model. The algorithm performs similarly to other existing algorithms for map matching, but runs faster and forgoes the use of memory-intensive shortest path algorithms. The results for the algorithm on data collected around Palo Alto are provided, and various potential improvements are listed at the end.